A complete pivoting strategy for the right-looking Robust Incomplete Factorization preconditioner

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complete pivoting strategy for the left-looking Robust Incomplete Factorization preconditioner

In this paper, we have used a complete pivoting strategy to compute the left-looking version of RIF preconditioner. This pivoting is based on the complete pivoting strategy of the IJK version of Gaussian Elimination process. There is a parameter α to control the pivoting process. To study the effect of α on the quality of the left-looking version of RIF preconditioner with complete pivoting str...

متن کامل

Complete pivoting strategy for the $IUL$ preconditioner obtained from Backward Factored APproximate INVerse process

‎In this paper‎, ‎we use a complete pivoting strategy to compute the IUL preconditioner obtained as the by-product of the Backward Factored APproximate INVerse process‎. ‎This pivoting is based on the complete pivoting strategy of the Backward IJK version of Gaussian Elimination process‎. ‎There is a parameter $alpha$ to control the complete pivoting process‎. ‎We have studied the effect of dif...

متن کامل

A robust incomplete factorization preconditioner for positive definite matrices

We describe a novel technique for computing a sparse incomplete factorization of a general symmetric positive de nite matrix A. The factorization is not based on the Cholesky algorithm (or Gaussian elimination), but on A-orthogonalization. Thus, the incomplete factorization always exists and can be computed without any diagonal modi cation. When used in conjunction with the conjugate gradient a...

متن کامل

Computing a block incomplete LU preconditioner as the by-product of block left-looking A-biconjugation process

In this paper, we present a block version of incomplete LU preconditioner which is computed as the by-product of block A-biconjugation process. The pivot entries of this block preconditioner are one by one or two by two blocks. The L and U factors of this block preconditioner are computed separately. The block pivot selection of this preconditioner is inherited from one of the block versions of...

متن کامل

An Incomplete Factorization Preconditioner For LMS Adaptive Filter

In this paper an efficient incomplete factorization preconditioner is proposed for the Least Mean Squares (LMS) adaptive filter. The proposed preconditioner is approximated from a priori knowledge of the factors of input correlation matrix with an incomplete strategy, motivated by the sparsity patter of the upper triangular factor in the QRD-RLS algorithm. The convergence properties of IPLMS al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Mathematics with Applications

سال: 2012

ISSN: 0898-1221

DOI: 10.1016/j.camwa.2012.08.001